# 递归
def jc(n):
  if n == 0 or n == 1:
    return 1
  else:
    return n * jc(n-1)

print(jc(10))
# 3628800

# -----------------------

# 阶乘
def fib(n):
  if n == 1:
    return 0
  elif n == 2:
    return 1
  else:
    return fib(n-1) + fib(n-2)

print(fib(10))
# 34